Random oriented trees: A model of drainage networks
نویسندگان
چکیده
منابع مشابه
Profiles of random trees: Plane-oriented recursive trees
We summarize several limit results for the profile of random plane-oriented recursive trees. These include the limit distribution of the normalized profile, asymptotic bimodality of the variance, asymptotic approximations of the expected width and the correlation coefficients of two level sizes. We also unveil an unexpected connection between the profile of plane-oriented recursive trees (with ...
متن کاملLimit theorems for random spatial drainage networks
Suppose that under the action of gravity, liquid drains through the unit d-cube via a minimal-length network of channels constrained to pass through random sites and to flow with nonnegative component in one of the canonical orthogonal basis directions of Rd, d ≥ 2. The resulting network is a version of the so-called minimal directed spanning tree. We give laws of large numbers and convergence ...
متن کاملProfiles of random trees: plane-oriented recursive trees1
We derive several limit results for the profile of random plane-oriented recursive trees. These include the limit distribution of the normalized profile, asymptotic bimodality of the variance, asymptotic approximation to the expected width and the correlation coefficients of two level sizes. Most of our proofs are based on a method of moments. We also discover an unexpected connection between t...
متن کاملObject-oriented mapping of urban trees using Random Forest classifiers
Since vegetation in urban areas delivers crucial ecological services as a support to human well-being and to the urban population in general, its monitoring is a major issue for urban planners. Mapping and monitoring the changes in urban green spaces are important tasks because of their functions such as the management of air, climate and water quality, the reduction of noise, the protection of...
متن کاملBranches in random recursive k-ary trees
In this paper, using generalized {polya} urn models we find the expected value of the size of a branch in recursive $k$-ary trees. We also find the expectation of the number of nodes of a given outdegree in a branch of such trees.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Applied Probability
سال: 2004
ISSN: 1050-5164
DOI: 10.1214/105051604000000288